Doubly connected geodetic number of graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unavoidable doubly connected large graphs

A connected graph is double connected if its complement is also connected The following Ramsey type theorem is proved in this paper There exists a function h n de ned on the set of integers exceeding three such that every double connected graph on at least h n vertices must contain as an induced subgraph a special double connected graph which is either one of the following graphs or the complem...

متن کامل

On the geodetic number of median graphs

A set of vertices S in a graph is called geodetic if every vertex of this graph lies on some shortest path between two vertices from S. In this paper, minimum geodetic sets in median graphs are studied with respect to the operation of peripheral expansion. Along the way geodetic sets of median prisms are considered and median graphs that possess a geodetic set of size two are characterized. © 2...

متن کامل

The geodetic number of strong product graphs

For two vertices u and v of a connected graph G, the set IG[u, v] consists of all those vertices lying on u − v geodesics in G. Given a set S of vertices of G, the union of all sets IG[u, v] for u, v ∈ S is denoted by IG[S]. A set S ⊆ V (G) is a geodetic set if IG[S] = V (G) and the minimum cardinality of a geodetic set is its geodetic number g(G) of G. Bounds for the geodetic number of strong ...

متن کامل

The connected edge geodetic number of a graph

For a non-trivial connected graph G, a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets and any edge geodetic set of order g1(G) is an edge geodetic basis. A connected edge geodetic set of G is an edge geodetic set S such that the ...

متن کامل

The upper connected edge geodetic number of a graph

For a non-trivial connected graph G, a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets and any edge geodetic set of order g1(G) is an edge geodetic basis. A connected edge geodetic set of G is an edge geodetic set S such that the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaya Journal of Matematik

سال: 2018

ISSN: 2319-3786,2321-5666

DOI: 10.26637/mjm0603/0025